Absolute convergence of rational series is semi-decidable
نویسندگان
چکیده
منابع مشابه
Thurston Equivalence to a Rational Map Is Decidable
We demonstrate that the question whether or not a given topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.
متن کاملDecidable Cases of the Rational Sequence Problem
Partial results concerning the decidability of the Rational Sequence Problem are presented. The two most notable make use of methods drawn from transcendental number theory and computational commutative algebra , respectively.
متن کاملOn absolute generalized Norlund summability of double orthogonal series
In the paper [Y. Okuyama, {it On the absolute generalized N"{o}rlund summability of orthogonal series},Tamkang J. Math. Vol. 33, No. 2, (2002), 161-165] the author has found some sufficient conditions under which an orthogonal seriesis summable $|N,p,q|$ almost everywhere. These conditions are expressed in terms of coefficients of the series. It is the purpose ofthis paper to extend this result...
متن کاملConvergence of Rational Interpolants∗
The convergence of (diagonal) sequences of rational interpolants to an analytic function is investigated. Problems connected with their definition are shortly discussed. Results about locally uniform convergence are reviewed. Then the convergence in capacity is studied in more detail. Here, a central place is taken by a theorem about the convergence in capacity of rational interpolants to funct...
متن کاملSemi-decidable Synthesis for Triangular Hybrid Systems
The algorithmic design of least restrictive controllers for hybrid systems that satisfy reachability specifications has received much attention recently. Despite the importance of algorithmic approaches to controller design for hybrid systems, results that guarantee termination of the algorithms have been limited. In this paper, we extend recent decidability results on controller synthesis for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.004